Complex zeros of the modified Bessel function $K\sb{n}(Z)$

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Application of the Finite Element Approximation Method to Find the Complex Zeros of the Modified Bessel Function Kn(z)

Using a finite element approximation, an iterative optimization scheme is described to find the z zeros of Kniz) for fixed order n. Two computer programs have been implemented to find the complex zeros with a computational accuracy of either 13 or 27 significant digits. The optimization scheme described in the paper may also be readily applied to find real and complex zeros of an arbitrary func...

متن کامل

On approximating the modified Bessel function of the second kind

In the article, we prove that the double inequalities [Formula: see text] hold for all [Formula: see text] if and only if [Formula: see text] and [Formula: see text] if [Formula: see text], where [Formula: see text] is the modified Bessel function of the second kind. As applications, we provide bounds for [Formula: see text] with [Formula: see text] and present the necessary and sufficient cond...

متن کامل

“BEST POSSIBLE” UPPER AND LOWER BOUNDS FOR THE ZEROS OF THE BESSEL FUNCTION Jν(x)

Let jν,k denote the k-th positive zero of the Bessel function Jν(x). In this paper, we prove that for ν > 0 and k = 1, 2, 3, . . . , ν − ak 21/3 ν < jν,k < ν − ak 21/3 ν + 3 20 ak 21/3 ν1/3 . These bounds coincide with the first few terms of the well-known asymptotic expansion jν,k ∼ ν − ak 21/3 ν + 3 20 ak 21/3 ν1/3 + · · · as ν →∞, k being fixed, where ak is the k-th negative zero of the Airy...

متن کامل

On the Localization and Computation of Zeros of Bessel Functions

The topological degree of a continuous mapping is implemented for the calculation of the total number of the simple real zeros within any interval of the Bessel functions of first and second kind and their derivatives. A new algorithm, based on this implementation, is given for the localization and isolation of these zeros. Furthermore, a second algorithm is presented for their computation empl...

متن کامل

Lower Bounds for the Zeros of Bessel Functions

Let jp „ denote the nth positive zero of J , p > 0. Then / ■■> 7\'/2 Jp.n > Oln + P) ■ We begin by considering the eigenvalue problem (1) -(•*/)' + x~y = X2x2p-Xy, X,p>0, (2) y(a) =y(\) = 0, 0 < a < 1. For simplicity of notation we will set q = p~x. It is easily verified that the general solution of (1) is y(x) = CxJq(Xqxx/q) + C2Yq(Xqxx'q) and that the eigenvalues are given by Jq(Xq)Yq(Xqax/q)...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematics of Computation

سال: 1972

ISSN: 0025-5718

DOI: 10.1090/s0025-5718-1972-0314237-4